python2.7 ../probfd-qcomp19/jani-to-ppddl/Jani_PPDDL_Compiler.py pnueli-zuck.5.jani -c ../probfd-qcomp19/jani-to-ppddl/config_mutual.py
python2.7 ../probfd-qcomp19/builds/release64/bin/translate/translate.py pnueli-zuck.5-domain.ppddl pnueli-zuck.5-problem.ppddl
../probfd-qcomp19/builds/release64/bin/downward --sas output.sas --engine fretpi-hdp --heuristic hmax --enable-caching --epsilon 1e-6
Parsing...
Parsing: [2.170s CPU, 2.171s wall-clock]
Normalizing task... [0.140s CPU, 0.140s wall-clock]
Instantiating...
Generating Datalog program... [0.160s CPU, 0.160s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [2.190s CPU, 2.198s wall-clock]
Preparing model... [2.170s CPU, 2.170s wall-clock]
Generated 113313 rules.
Computing model... [33.850s CPU, 33.850s wall-clock]
3794666 relevant atoms
855280 auxiliary atoms
4649946 final queue length
8443856 total queue pushes
Completing instantiation... [155.100s CPU, 155.104s wall-clock]
Instantiating: [195.260s CPU, 195.281s wall-clock]
Computing fact groups...
Finding invariants...
5 initial candidates
Finding invariants: [0.450s CPU, 0.453s wall-clock]
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
81 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.000s wall-clock]
Computing fact groups: [0.450s CPU, 0.454s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.010s CPU, 0.000s wall-clock]
Processing axioms: [6.430s CPU, 6.421s wall-clock]
Translating task: [118.790s CPU, 118.781s wall-clock]
2375980 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
0 propositions removed
Detecting unreachable propositions: [47.300s CPU, 47.308s wall-clock]
Reordering and filtering variables...
81 of 81 variables necessary.
0 of 0 mutex groups necessary.
2375981 of 2375981 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [7.880s CPU, 7.874s wall-clock]
Translator variables: 81
Translator derived variables: 0
Translator facts: 162
Translator goal facts: 1
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 2375981
Translator axioms: 0
Translator task size: 12618087
Translator peak memory: 17334860 KB
Writing output... [12.390s CPU, 12.393s wall-clock]
Done! [391.560s CPU, 391.594s wall-clock]
reading input... [t=2.8745e-05s]
done reading input! [t=2.07465s]
variables: 81
goals: 1
actions: 2375981
axioms: 0
has conditional effects: 0
reconstructing probabilistic actions... [t=2.07468s]
done reconstructing probabilistic actions! [t=4.57187s]
probabilistic actions: 2375976 (with 2375981 outcomes)
constructing successor generator... [t=5.47398s]
done constructing successor generator! [t=5.93069s]
Bytes per state: 12
Property: MaxProb
Preparing hmax dead end detection heuristic... [t=6.12242s]
hmax initialization done! [t=6.5156s]
Engine: FRET-pi with HDP
Starting trap elimination heuristic search wrapper...
Initial state reward: 1
Expansions: 56
Registered states: 191
Generated states: 585861
Cached transitions: 585855
Expansion cache hits: 0
Transition cache hits: 56
Approximate transition cache memory usage: 11448KB
Solver time: 0.3483465350000001237s
Total time: 6.916005673999999992s